Evaluating an Approach to Reasoning with Cases Using Abstract Dialectical Frameworks
نویسندگان
چکیده
Abstract Dialetical Frameworks (ADFs) are a recent development in computational argumentation which are, it has been suggested, a fruitful way of implementing factor based reasoning with legal cases. In this paper we evaluate this proposal, by reconstructing CATO using ADFs. We evaluate the ease of implementation, the efficacy of the resulting program, ease of refinement of the program, transparency of the reasoning, relation to formal argumentation techniques, and transferability across domains.Dialetical Frameworks (ADFs) are a recent development in computational argumentation which are, it has been suggested, a fruitful way of implementing factor based reasoning with legal cases. In this paper we evaluate this proposal, by reconstructing CATO using ADFs. We evaluate the ease of implementation, the efficacy of the resulting program, ease of refinement of the program, transparency of the reasoning, relation to formal argumentation techniques, and transferability across domains.
منابع مشابه
Abstract Dialectical Frameworks for Legal Reasoning
Dialectical Frameworks for Legal Reasoning Latifa AL-ABDULKARIM, Katie ATKINSON, Trevor BENCH-CAPON Department of Computer Science, The University of Liverpool, UK Abstract. In recent years a powerful generalisation of Dung’s abstract argumentation frameworks, Abstract Dialectical Frameworks (ADF), has been developed. ADFs generalise the abstract argumentation frameworks introduced by Dung by r...
متن کاملReasoning about Preferences in Structured Extended Argumentation Frameworks
This paper combines two recent extensions of Dung’s abstract argumentation frameworks in order to define an abstract formalism for reasoning about preferences in structured argumentation frameworks. First, extended argumentation frameworks extend Dung frameworks with attacks on attacks, thus providing an abstract dialectical semantics that accommodates argumentation-based reasoning about prefer...
متن کاملInstantiating rule-based defeasible theories in abstract dialectical frameworks and beyond
dialectical frameworks and beyond
متن کاملSplitting Abstract Dialectical Frameworks
Among the abundance of generalizations of abstract argumentation frameworks, the formalism of abstract dialectical frameworks (ADFs) proved to be powerful in modelling various argumentation problems. Implementations of reasoning tasks that come within ADFs struggle with their high computational complexity. Thus methods simplifying the evaluation process are required. One such method is splittin...
متن کاملThe DIAMOND System for Computing with
We present DIAMOND, an implementation of Brewka and Woltran’s abstract dialectical frameworks (ADFs). The system uses answer set programming encodings to compute interpretations of ADFs according to various semantics. We evaluate the performance of the system using an actual reasoning problem as opposed to using randomly generated frameworks.
متن کامل